/*
 * (c) Copyright 2009 Hewlett-Packard Development Company, LP
 * All rights reserved.
 * [See end of file]
 */

package com.hp.hpl.jena.clusteredtdb.base;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;

import lib.Tuple;

import com.hp.hpl.jena.clusteredtdb.pgraph.BulkNodeTable;
import com.hp.hpl.jena.graph.Node;
import com.hp.hpl.jena.graph.Triple;
import com.hp.hpl.jena.tdb.store.NodeId;



public class BulkTupleLib {
	public static ThreadedBufferedIterator<Triple> convertToTriples(final BulkNodeTable nodeTable, Iterator<Tuple<NodeId>> iter, int bufSize)
    {
        BulkTransform<Tuple<NodeId>, Triple> action =  new BulkTransform<Tuple<NodeId>, Triple>(){
            @Override
            public Iterator<Triple> convert(Iterator<Tuple<NodeId>> items, int bufSize)
            {
                return bulkTriple(nodeTable, items, bufSize) ;
            }} ;
        return BulkIterLibrary.mapBulk(iter, action, bufSize) ;
    }

	//TODO update to provide out-of-order results as they come in
	//NB in doing this, unsure if using a hashmap to index the buffer is fast or not - may actually
	//be faster to scan the array??
	protected static Iterator<Triple> bulkTriple(BulkNodeTable nodeTable, Iterator<Tuple<NodeId>> items, int bufSize) {
		ArrayList<Tuple<NodeId>> al = new ArrayList<Tuple<NodeId>>(bufSize);
		HashSet<NodeId> s = new HashSet<NodeId>(bufSize);
		int i = 0;
		while(i < bufSize && items.hasNext()) {
			Tuple<NodeId> tup = items.next();
			al.add(tup);
			s.add(tup.get(0));
			s.add(tup.get(1));
			s.add(tup.get(2));
			i++;
		}
		Map<NodeId,Node>nodeMap = nodeTable.retrieveNodesByNodeIds(s);
		ArrayList<Triple> ret = new ArrayList<Triple>(al.size());
		
		Iterator<Tuple<NodeId>> it = al.iterator();
		while(it.hasNext()) {
			Tuple<NodeId> tup = it.next();
			ret.add(new Triple(nodeMap.get(tup.get(0)),nodeMap.get(tup.get(1)),nodeMap.get(tup.get(2))));
		}
		return ret.iterator();
		
	}
}

/*
 * (c) Copyright 2009 Hewlett-Packard Development Company, LP
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
